Self-organisation in a system of binary strings
نویسنده
چکیده
We discuss a system of autocatalytic sequences of binary numbers. Sequences come in two forms, a 1-dimensional form (operands) and a 2-dimensional form (operators) that are able to react with each other. The resulting reaction network shows signs of emerging metabolisms. We discuss the general framework and examine speciic interactions for a system with strings of length 4 bits. A self-maintaining network of string types and parasitic interactions are shown to exist.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملRobust Agent Based Distribution System Restoration with Uncertainty in Loads in Smart Grids
This paper presents a comprehensive robust distributed intelligent control for optimum self-healing activities in smart distribution systems considering the uncertainty in loads. The presented agent based framework obviates the requirements for a central control method and improves the reliability of the self-healing mechanism. Agents possess three characteristics including local views, decentr...
متن کاملSelf-Replicating Sequences of Binary Numbers: The Build-Up of Complexity
A recently introduced system of self-replicating sequences of binary numbers (strings) is generalized. It is extended to include st rings of arbitrary length . For this purpose, first , the folding methods of st rings into two-dimensional operat ors are expanded to include strings of arbitr ary size. Second, rules of interact ion between str ings of different lengths are established. As a natur...
متن کاملA Generative Model for Self/Non-self Discrimination in Strings
A statistical generative model is presented as an alternative to negative selection in anomaly detection of string data. We extend the probabilistic approach to binary classification from fixed-length binary strings into variable-length strings from a finite symbol alphabet by fitting a mixture model of multinomial distributions for the frequency of adjacent symbols. Robust and localized change...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کامل